Generalized partitions of graphs
نویسندگان
چکیده
منابع مشابه
Partitions of Generalized Split Graphs
We discuss matrix partition problems for graphs that admit a partition into k independent sets and ` cliques. We show that when k + ` 6 2, any matrix M has finitely many (k, `) minimal obstructions and hence all of these problems are polynomial time solvable. We provide upper bounds for the size of any (k, `) minimal obstruction when k = ` = 1 (split graphs), when k = 2, ` = 0 (bipartite graphs...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملA Generalized Distance in Graphs and Centered Partitions
This paper is concerned with a new distance in undirected graphs with weighted edges, which gives new insights into the structure of all minimum spanning trees of a graph. This distance is a generalized one, in the sense that it takes values in a certain Heyting semigroup. More precisely, it associates with each pair of distinct vertices in a connected component of a graph the set of all paths ...
متن کاملBrick partitions of graphs
For each rational number q ≥ 1, we describe two partitions of the vertex set of a graph G, called the q-brick partition and the q-superbrick partition. The special cases when q = 1 are the partitions given by the connected components and the 2-edge-connected components of G, respectively. We obtain structural results on these partitions and describe their relationship to the principal partition...
متن کاملStar partitions of graphs
Let G be a graph and n ≥ 2 an integer. We prove that the following are equivalent: (i) there is a partition (V1, . . . , Vm) of V (G) such that each Vi induces one of stars K1,1, . . . ,K1,n, and (ii) for every subset S of V (G), G\S has at most n|S| components with the property that each of their blocks is an odd order complete graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00124-3